Halving Lines and Underlying Graphs
نویسندگان
چکیده
In an Apollonian circle packing, the curvatures a, b, c, d of any four mutually tangent circles satisfy Descartes’ equation, 2(a + b + c + d) = (a+ b+ c+ d). For an equilateral triangle and a point P , if a, b, c, d denote the squares of the lengths of the sides of the triangle and the distances from P to the vertices of the triangle, then a, b, c, d, satisfy 3(a+ b+ c+d) = (a+ b+ c+d). Define a quadruple of nonnegative integers (a, b, c, d) to be a triangle quadruple if it satisfies this equation. It is easy to verify that if (a, b, c, d) is a triangle quadruple, then (a, b, c, a+ b+ c− d) is also. This operation and analogous ones for the other elements can be represented by four matrices, and define the triangle group to be the group with these as generators. This work analyzes some properties of triangle quadruples and the triangle group. We show that all triangle quadruples can be reduced to one unique root quadruple, and that all primitive root quadruples are contained in one orbit. We also compute the largest triangle quadruple obtainable at each stage and an approximation for the number of triangle quadruples below a given height. Finally, we prove that the triangle group is a hyperbolic Coxeter group.
منابع مشابه
Halving Lines and Their Underlying Graphs
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
متن کاملSets of Points with Many Halving Lines
We used a genetic search algorithm to find sets of points with many halving lines. There are sets of 10 points with 13 halving lines, 12 points with 18 halving lines, 14 points with 22 halving lines, 16 points with 27 halving lines, and 18 points with 32 halving lines. We find a construction generalizing the 12 point configuration and show that, for any n = 3 · 2, there are configurations of n ...
متن کاملDense point sets with many halving lines
We construct a dense point set of n points in the plane with ne( √ logn) halving lines. This improves the bound O(n log n) of Edelsbrunner, Valtr and Welzl from 1997. We also observe that the upper bound on the maximum number of halving lines of dense point set can be improved to O(n). Our construction can be generalized to higher dimensions, for any d we construct a dense point set of n points...
متن کاملThe maximum number of halving lines and the rectilinear crossing number of Kn for n ≤ 27 . Bernardo
For n ≤ 27 we present exact values for the maximum number h(n) of halving lines and eh(n) of halving pseudolines, determined by n points in the plane. For this range of values of n we also present exact values of the rectilinear cr(n) and the pseudolinear e cr(n) crossing number of the complete graph Kn. eh(n) and e cr(n) are new for n ∈ {14, 16, 18, 20, 22, 23, 24, 25, 26, 27}, h(n) is new for...
متن کاملOn $(\le k)$-edges, crossings, and halving lines of geometric drawings of Kn
Let P be a set of points in general position in the plane. Join all pairs of points in P with straight line segments. The number of segment-crossings in such a drawing, denoted by cr(P ), is the rectilinear crossing number of P . A halving line of P is a line passing though two points of P that divides the rest of the points of P in (almost) half. The number of halving lines of P is denoted by ...
متن کاملGeometric Dilation and Halving Distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کامل